Figurative Tours and Braids
نویسندگان
چکیده
We start with a rectangular grid of points, and we connect pairs of points to form either a tour (a Hamiltonian cycle) or a braid (a collection of disjoint paths that start in the top row and end on the bottom). In each case, our goal is to design a graph that will closely resemble a grayscale target image when viewed from a distance. From up close, the graph will look like an abstract pattern. We formulate these design problems as integer programming problems.
منابع مشابه
A Stylistic Approach to Translation: Figurative language devices in the Persian renderings of Alcott's Little Women
The present study aimed firstly at investigating the impact of translators' style on figurative language translation from English into Persian. Secondly, it intended to find which strategies were most frequently adopted by Persian translators to translate figures of speech into Persian. Lastly, the study sought to check the extent of transference of figurative features of literary texts in Engl...
متن کاملWhy Figurative Language: Perceived Discourse Goals for Metaphors and Similes by L2 Learners
The goal of this study was to investigate the kinds of discourse goals that Iranian EFL learners perceive as the most probable reasons behind the utterance of figurative language, metaphors and similes, with reference to 4 independent variables of Figure Type (Metaphor or Simile), Tenor Concreteness (Concrete or Abstract), Context (List Format or Story), and Modality (Oral, Written, and Both). ...
متن کاملOn Singular Braids
In Vassiliev theory, there is a natural monoid homo-morphism from n-strand singular braids to the group algebra of n-strand braid group. J. Birman conjectured that this monoid homomorphism is injective. We show that the monoid homomor-phism is injective on braids with up to three singularities and that Birman's conjecture is equivalent to that singular braids are dis-tinguishable by Vassiliev b...
متن کاملConvergence of Handle Reduction of Braids
We give a proof for the convergence of the handle reduction algorithm of braids that is both more simple and more precise than the ones of [2] or [3]. The prerequisites are Garside’s theory of positive braids, and one technical result about Artin’s representation of braids available in chapter V
متن کامل2 00 4 Virtual Braids
Just as classical knots and links can be represented by the closures of braids, so can virtual knots and links be represented by the closures of virtual braids [17]. Virtual braids have a group structure that can be described by generators and relations, generalizing the generators and relations of the classical braid group. This structure of virtual braids is worth study for its own sake. The ...
متن کامل